Observational Mu-Calculus
نویسندگان
چکیده
We propose an extended modal mu-calculus to provide an ‘assembly language’ for modal logics for real time, value-passing calculi, and other extended models of computation.
منابع مشابه
Symbolic Model Checking: 10^20 States and Beyond
Many diierent methods have been devised for automatically verifying nite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of states. We describe a general method that represents the state space symbolically instead of explicitl...
متن کاملSymbolic Model Checking: IO*’ States and Beyond*
Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of states. We describe a general method that represents the state space symbolical/y instead of explic...
متن کاملEnriching OCL Using Observational Mu-Calculus
The Object Constraint Language is a textual specification language which forms part of the Unified Modelling Language[8]. Its principal uses are specifying constraints such as well-formedness conditions (e.g. in the definition of UML itself) and specifying contracts between parts of a system being modelled in UML. Focusing on the latter, we propose a systematic way to extend OCL with temporal c...
متن کاملProcess Types as a Descriptive Tool for Interaction - Control and the Pi-Calculus
We demonstrate a tight relationship between linearly typed π-calculi and typed λ-calculi by giving a type-preserving translation from the call-by-value λμ-calculus into a typed π-calculus. The λμ-calculus has a particularly simple representation as typed mobile processes. The target calculus is a simple variant of the linear π-calculus. We establish full abstraction up to maximally consistent o...
متن کاملAn Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus - Extended Abstract
We study the Λμ-calculus, extended with explicit substitution, and define a compositional output-based translation into a variant of the π-calculus with pairing. We show that this translation preserves single-step explicit head reduction with respect to contextual equivalence. We use this result to show operational soundness for head reduction, adequacy, and operational completeness. Using a no...
متن کامل